Enhancing three variants of harmony search algorithm for continuous optimization problems

Meta-heuristic algorithms are well-known optimization methods, for solving real-world optimization problems. Harmony search (HS) is a recognized meta-heuristic algorithm with an efficient exploration process. But the HS has a slow convergence rate, which causes the algorithm to have a weak exploitation process in finding the global optima. Different variants of HS introduced in the literature to enhance the algorithm and fix its problems, but in most cases, the algorithm still has a slow convergence rate. Meanwhile, opposition-based learning (OBL), is an effective technique used to improve the performance of different optimization algorithms, including HS. In this work, we adopted a new improved version of OBL, to improve three variants of Harmony Search, by increasing the convergence rate speed of these variants and improving overall performance. The new OBL version named improved opposition-based learning (IOBL), and it is different from the original OBL by adopting randomness to increase the solution's diversity. To evaluate the hybrid algorithms, we run it on benchmark functions to compare the obtained results with its original versions. The obtained results show that the new hybrid algorithms more efficient compared to the original versions of HS. A convergence rate graph is also used to show the overall performance of the new algorithms

Spatial information of fuzzy clustering based mean best artificial bee colony algorithm for phantom brain image segmentation

Fuzzy c-means algorithm (FCM) is among the most commonly used in the medical image segmentation process. Nevertheless, the traditional FCM clustering approach has been several weaknesses such as noise sensitivity and stuck in local optimum, due to FCM hasn’t able to consider the information of contextual. To solve FCM problems, this paper presented spatial information of fuzzy clustering-based mean best artificial bee colony algorithm, which is called SFCM-MeanABC. This proposed approach is used contextual information in the spatial fuzzy clustering algorithm to reduce sensitivity to noise and its used MeanABC capability of balancing between exploration and exploitation that is explore the positive and negative directions in search space to find the best solutions, which leads to avoiding stuck in a local optimum. The experiments are carried out on two kinds of brain images the Phantom MRI brain image with a different level of noise and simulated image. The performance of the SFCM-MeanABC approach shows promising results compared with SFCM-ABC and other stats of the arts

Improved flat mobile core network architecture for 5G mobile communication systems

The current mobile network core is built based on a centralized architecture, including the S-GW and P-GW entities to serve as mobility anchors. Nevertheless, this architecture causes non-optimal routing and latency for control messages. In contrast, the fifth generation (5G) network will redesign the network service architecture to improve changeover management and deliver clients a better Quality-of-Experience (QoE). To enhance the design of the existing network, a distributed 5G core architecture is introduced in this study. The control and data planes are distinct, and the core network also combines IP functionality anchored in a multi-session gateway design. We also suggest a control node that will fully implement the control plane and result in a flat network design. Its architecture, therefore, improves data delivery, mobility, and attachment speed. The performance of the proposed architecture is validated by improved NS3 simulation to run several simulations, including attachment and inter- and intra-handover. According to experimental data, the suggested network is superior in terms of initial attachment, network delay, and changeover management

Fuzzy Clustering Algorithm Based on Improved Global Best-Guided Artificial Bee Colony with New Search Probability Model for Image Segmentation

Clustering using fuzzy C-means (FCM) is a soft segmentation method that has been extensively investigated and successfully implemented in image segmentation. FCM is useful in various aspects, such as the segmentation of grayscale images. However, FCM has some limitations in terms of its selection of the initial cluster center. It can be easily trapped into local optima and is sensitive to noise, which is considered the most challenging issue in the FCM clustering algorithm. This paper proposes an approach to solve FCM problems in two phases. Firstly, to improve the balance between the exploration and exploitation of improved global best-guided artificial bee colony algorithm (IABC). This is achieved using a new search probability model called PIABC that improves the exploration process by choosing the best source of food which directly affects the exploitation process in IABC. Secondly, the fuzzy clustering algorithm based on PIABC, abbreviated as PIABC-FCM, uses the balancing of PIABC to avoid getting stuck into local optima while searching for the best solution having a set of cluster center locations of FCM. The proposed method was evaluated using grayscale images. The performance of the proposed approach shows promising outcomes when compared with other related works

Digital image watermarking using discrete cosine transformation based linear modulation

Abstract The proportion of multimedia traffic in data networks has grown substantially as a result of advancements in IT. As a result, it's become necessary to address the following challenges in protecting multimedia data: prevention of unauthorized disclosure of sensitive data, in addition to tracking down the leak's origin, making sure no alterations may be made without permission, and safeguarding intellectual property for digital assets. watermarking is a technique developed to combat this issue, which transfer secure data over the network. The main goal of invisible watermarking is a hidden exchange of data and a message from being discovered by a third party. The objective of this work is to develop a digital image watermarking using discrete cosine transformation based linear modulation. This paper proposed an invisible watermarking method for embedding information into the transformation domain for the grey scale images. This method used the embedding of a stego-text into the least significant bit (LSB) of the Discrete Cosine Transformation (DCT) coefficient by using a linear modulation algorithm. Also, a stego-text is embedded with different sizes ten times within images after embedding the stego-image immune to different kinds of attack, such as salt and pepper, rotation, cropping, and JPEG compression with different criteria. The proposed method is tested using four benchmark images. Also, to evaluate the embedding effect, PSNR, NC and BER are calculated. The outcomes show that the proposed approach is practical and robust, where the obtained results are promising and do not raise any suspicion. In addition, it has a large capacity, and its results are imperceptible, especially when 1bit/block is embedded

Fuzzy Clustering Algorithm Based on Improved Global Best-Guided Artificial Bee Colony with New Search Probability Model for Image Segmentation

Clustering using fuzzy C-means (FCM) is a soft segmentation method that has been extensively investigated and successfully implemented in image segmentation. FCM is useful in various aspects, such as the segmentation of grayscale images. However, FCM has some limitations in terms of its selection of the initial cluster center. It can be easily trapped into local optima and is sensitive to noise, which is considered the most challenging issue in the FCM clustering algorithm. This paper proposes an approach to solve FCM problems in two phases. Firstly, to improve the balance between the exploration and exploitation of improved global best-guided artificial bee colony algorithm (IABC). This is achieved using a new search probability model called PIABC that improves the exploration process by choosing the best source of food which directly affects the exploitation process in IABC. Secondly, the fuzzy clustering algorithm based on PIABC, abbreviated as PIABC-FCM, uses the balancing of PIABC to avoid getting stuck into local optima while searching for the best solution having a set of cluster center locations of FCM. The proposed method was evaluated using grayscale images. The performance of the proposed approach shows promising outcomes when compared with other related works

A Novel Hybrid Prairie Dog Algorithm and Harris Hawks Algorithm for Resource Allocation of Wireless Networks

Enhancing the performance of wireless networks and communication systems requires careful resource allocation. Resource allocation optimization, however, is regarded as a mixed-integer non-linear programming (MINLP) problem, which is NP-hard and non-convex. Due to the serious limitations of conventional procedures, solving such optimization problems requires specialized approaches. For instance, no optimal performance can be guaranteed using the heuristic algorithms; besides, the global optimization systems suffer from exponential computation complexity and considerable training duration. This paper introduces an improved version of the Prairie dog optimization (PDO) algorithm by the Harris Hawks optimization (HHO) algorithm. The developed technique, namely HPDO, relies on using the HHO operators to improve the exploitation capability of PDO during the searching procedure. The significance of the presented HPDO is examined and analyzed using 23 mathematical benchmark functions and CEC-2019 with several dimension sizes to show the ability to solve different numerical problems. In addition to the resource allocation problem, the HPDO is evaluated using three engineering problems: The spring design issue, The pressure vessel design issue, and the Welded beam design issue. The experimental and simulation results demonstrated that the exploration and exploitation search method of HPDO and its convergence rate had remarkably increased. The experimental results of the resource allocation of the wireless network with different numbers of users 10, 50, and 100 achieve superior results compared to other algorithms with 0.136, 2.75, and 3.64, respectively.The results showed the supremacy of the HPDO over the traditional HHO, PDO, and several with state-of-the-art algorithms